Emery Roe on Complexity: Avoiding Triangulation-Strangulation
نویسندگان
چکیده
منابع مشابه
Complexity of the Delaunay Triangulation of Points on Polyhedral Surfaces
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt età la diffusion de documents scientifiques de niveau r...
متن کاملThe Strange Complexity of Constrained Delaunay Triangulation
The problem of determining whether a polyhedron has a constrained Delaunay tetrahedralization is NP-complete. However, if no five vertices of the polyhedron lie on a common sphere, the problem has a polynomial-time solution. Constrained Delaunay tetrahedralization has the unusual status (for a small-dimensional problem) of being NP-hard only for degenerate inputs.
متن کاملThe Complexity of MaxMin Length Triangulation
In 1991, Edelsbrunner and Tan gave an O(n) algorithm for finding the MinMax Length triangulation of a set of points in the plane. In this paper we resolve one of the open problems stated in that paper, by showing that finding a MaxMin Length triangulation is an NPcomplete problem. The proof implies that (unless P=NP), there is no polynomial-time approximation algorithm that can approximate the ...
متن کاملAvoiding Complexity Catastrophe 1 AVOIDING COMPLEXITY CATASTROPHE IN COEVOLUTIONARY POCKETS: STRATEGIES FOR RUGGED LANDSCAPES
Can firms and coevolutionary groups suffer from too much interdependent complexity? Is complexity theory an alternative explanation to competitive selection for the emergent order apparent in coevolutionary industry groups? The biologist, Stewart Kauffman, suggests a theory of complexity catastrophe offering universal principles explaining phenomena normally attributed to Darwinian natural sele...
متن کاملOn the complexity of paths avoiding forbidden pairs
Given a graph G = (V,E), two fixed vertices s, t ∈ V and a set F of pairs of vertices (called forbidden pairs), the problem of a path avoiding forbidden pairs is to find a path from s to t that contains at most one vertex from each pair in F . The problem is known to be NP-complete in general and a few restricted versions of the problem are known to be in P. We study the complexity of the probl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Conservation Ecology
سال: 2000
ISSN: 1195-5449
DOI: 10.5751/es-00198-040210